Quadratic optimization over a polyhedral set
نویسندگان
چکیده
منابع مشابه
A Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA Smoothing Method for Sparse Optimization over Polyhedral Sets
In this paper, we investigate a class of heuristics schemes to solve the NP-hard problem of minimizing `0-norm over a polyhedral set. A wellknown approximation is to consider the convex problem of minimizing `1-norm. We are interested in nding improved results in cases where the problem in `1-norm does not provide an optimal solution to the `0-norm problem. We consider a relaxation technique us...
متن کاملAn active set algorithm for nonlinear optimization with polyhedral constraints
A polyhedral active set algorithm PASA is developed for solving a nonlinear optimization problem whose feasible set is a polyhedron. Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem. Rules are provided for branching between the two phases. Global convergence to a stationary point is established...
متن کاملA Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere
For a given graph the maximum independent set problem is to find a maximum subset of vertices no two of which are adjacent. We propose a heuristic for the maximum independent set problem which utilizes classical results for the problem of optimization of a quadratic function over a sphere. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.
متن کاملRepresentations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem
The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrixQ and a linear cost vector c. Different, but equivalent, representations of the pair (Q,c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2014
ISSN: 1314-7536
DOI: 10.12988/imf.2014.4234